An Associative Implementation Of Classical Convex Hull Algorithms

Implementation of Convex Hull algorithm for Associative Real Time Vision Machine Summer Student Report

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

An Associative Implementation of Graham's Convex Hull Algorithm

This paper presents a new parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan Algorithm. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and maximum functions. Also, ASC can be supported on...

A Computational Framework and SIMD Algorithmsfor Low - Level Support

Computation on and among data sets mapped to irregular, non-uniform, aggregates of processing elements (PEs) is a very important, but largely ignored, problem in parallel vision processing. Associative processing 11] is an eeective means of applying parallel processing to these computations 33], but is often restricted to operating on one data set at a time. What we propose is an additional lev...

An Associative Static and Dynamic Convex Hull Algorithm

This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull algorithms. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and max...